Elliptic curves and logarithmic derivatives
نویسندگان
چکیده
منابع مشابه
Elliptic Nets and Elliptic Curves
Elliptic divisibility sequences are integer recurrence sequences, each of which is associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base fields. Suppose E is an elliptic curve over a field K, and P1, . . . , Pn are points on E defined over K. To this information we associate an ...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملOn logarithmic derivatives
© Bulletin de la S. M. F., 1968, tous droits réservés. L’accès aux archives de la revue « Bulletin de la S. M. F. » (http://smf. emath.fr/Publications/Bulletin/Presentation.html) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impress...
متن کاملElliptic Curves and Cryptography
results in more than 30.000 hits, ranging from articles in mathematics and computer science to books and implementations and applications of the algorithms. There are a lot of different algorithms and also different ways to attack them, many of them involving a huge amount of theory. Moreover, the fact that still there is not an accepted standard on elliptic curve cryptography benefits the exis...
متن کاملElliptic Curves and Cryptography
Elliptic curves also figured prominently in the recent proof of Fermat's Last Theorem by Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently been utilized in devising algorithms for factoring integers, primality proving, and in public-key cryptography. In this article, we aim to give the reader an introduction to elliptic curve cryptosystems, and to demo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1999
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(97)00209-0